Non-approximability Results for Scheduling Problems with Minsum Criteria
نویسندگان
چکیده
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the problems under consideration can be approximated in polynomial time within arbitrarily good precision. Most of our results are derived by Max SNP hardness proofs. Among the investigated problems are: scheduling unrelated machines with job release dates, scheduling ow shops, scheduling open shops, scheduling parallel machines with precedence constraints and unit processing times, and two variants of the latter problem with unit communication delays.
منابع مشابه
A Best-compromise Bicriteria Scheduling Algorithm for Parallel Tasks
We consider in this paper the problem of scheduling a set of independent parallel tasks (jobs) with respect to two criteria, namely, the makespan (time of the last finishing job) and the minsum (average completion time). There exist several algorithms with a good performance guaranty for one of these criteria. We are interested here in studying the optimization of both criteria simultaneously. ...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملApproximation algorithms for shop scheduling problems with minsum objective: A correction
We consider a general class of multiprocessor shop scheduling problems, preemptive or nonpreemptive, with precedence constraints between operations, with job or operation release dates, and with a class of objective functions including weighted sums of job, operations and stage completion times. We present a general approximation method combining a linear programming relaxation in the operation...
متن کامل(Non)-Approximability for the Multi-criteria TSP(1, 2)
The approximability of multi-criteria combinatorial problems motivated a lot of articles. However, the non-approximability of this problems has never been investigated up to our knowledge. We propose a way to get some results of this kind which works for several problems and we put it into practice on a multi-criteria version of the traveling salesman problem with distances one and two (TSP (1,...
متن کاملNon-approximability results for scheduling
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the problems under consideration can be approximated in polynomial time within arbitrarily good precision. Most of our results are derived by APX-hardness proofs. We show that, whereas scheduling on unrelated machines with unit...
متن کامل